Computationally sound symbolic secrecy in the presence of hash functions
Identifieur interne : 005616 ( Main/Exploration ); précédent : 005615; suivant : 005617Computationally sound symbolic secrecy in the presence of hash functions
Auteurs : Véronique Cortier [France] ; Steve Kremer [France] ; Ralf Kusters [Suisse] ; Bogdan Warinschi [France]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 2006.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Cryptographie.
English descriptors
- KwdEn :
Abstract
The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper we devise and motivate a more appropriate secrecy criterion which exactly captures a standard cryptographic notion of secrecy for protocols involving public-key enryption and hash functions: protocols that satisfy it are computationally secure while any violation of our criterion directly leads to an attack. Furthermore, we prove that our criterion is decidable via an NP decision procedure. Our results hold for standard security notions for encryption and hash functions modeled as random oracles.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000382
- to stream PascalFrancis, to step Curation: 000651
- to stream PascalFrancis, to step Checkpoint: 000401
- to stream Main, to step Merge: 005806
- to stream Main, to step Curation: 005616
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Computationally sound symbolic secrecy in the presence of hash functions</title><author><name sortKey="Cortier, Veronique" sort="Cortier, Veronique" uniqKey="Cortier V" first="Véronique" last="Cortier">Véronique Cortier</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Loria, CNRS & INRIA project Cassis</s1><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>CNRS & INRIA project Cassis</wicri:noRegion><wicri:noRegion>Loria, CNRS & INRIA project Cassis</wicri:noRegion></affiliation></author><author><name sortKey="Kremer, Steve" sort="Kremer, Steve" uniqKey="Kremer S" first="Steve" last="Kremer">Steve Kremer</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>LSV, CNRS & ENS Cachan & INRIA project Secsi</s1><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>CNRS & ENS Cachan & INRIA project Secsi</wicri:noRegion><wicri:noRegion>LSV, CNRS & ENS Cachan & INRIA project Secsi</wicri:noRegion></affiliation></author><author><name sortKey="Kusters, Ralf" sort="Kusters, Ralf" uniqKey="Kusters R" first="Ralf" last="Kusters">Ralf Kusters</name><affiliation wicri:level="4"><inist:fA14 i1="03"><s1>ETH Zurich</s1><s3>CHE</s3><sZ>3 aut.</sZ></inist:fA14><country>Suisse</country><placeName><settlement type="city">Zurich</settlement><region nuts="3" type="region">Canton de Zurich</region></placeName><orgName type="university">École polytechnique fédérale de Zurich</orgName></affiliation></author><author><name sortKey="Warinschi, Bogdan" sort="Warinschi, Bogdan" uniqKey="Warinschi B" first="Bogdan" last="Warinschi">Bogdan Warinschi</name><affiliation wicri:level="1"><inist:fA14 i1="04"><s1>Loria, Univerité Henri Poincaré & INRIA project Cassis</s1><s3>FRA</s3><sZ>4 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>Univerité Henri Poincaré & INRIA project Cassis</wicri:noRegion><wicri:noRegion>Loria, Univerité Henri Poincaré & INRIA project Cassis</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">07-0531787</idno><date when="2006">2006</date><idno type="stanalyst">PASCAL 07-0531787 INIST</idno><idno type="RBID">Pascal:07-0531787</idno><idno type="wicri:Area/PascalFrancis/Corpus">000382</idno><idno type="wicri:Area/PascalFrancis/Curation">000651</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000401</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000401</idno><idno type="wicri:doubleKey">0302-9743:2006:Cortier V:computationally:sound:symbolic</idno><idno type="wicri:Area/Main/Merge">005806</idno><idno type="wicri:Area/Main/Curation">005616</idno><idno type="wicri:Area/Main/Exploration">005616</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Computationally sound symbolic secrecy in the presence of hash functions</title><author><name sortKey="Cortier, Veronique" sort="Cortier, Veronique" uniqKey="Cortier V" first="Véronique" last="Cortier">Véronique Cortier</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Loria, CNRS & INRIA project Cassis</s1><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>CNRS & INRIA project Cassis</wicri:noRegion><wicri:noRegion>Loria, CNRS & INRIA project Cassis</wicri:noRegion></affiliation></author><author><name sortKey="Kremer, Steve" sort="Kremer, Steve" uniqKey="Kremer S" first="Steve" last="Kremer">Steve Kremer</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>LSV, CNRS & ENS Cachan & INRIA project Secsi</s1><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>CNRS & ENS Cachan & INRIA project Secsi</wicri:noRegion><wicri:noRegion>LSV, CNRS & ENS Cachan & INRIA project Secsi</wicri:noRegion></affiliation></author><author><name sortKey="Kusters, Ralf" sort="Kusters, Ralf" uniqKey="Kusters R" first="Ralf" last="Kusters">Ralf Kusters</name><affiliation wicri:level="4"><inist:fA14 i1="03"><s1>ETH Zurich</s1><s3>CHE</s3><sZ>3 aut.</sZ></inist:fA14><country>Suisse</country><placeName><settlement type="city">Zurich</settlement><region nuts="3" type="region">Canton de Zurich</region></placeName><orgName type="university">École polytechnique fédérale de Zurich</orgName></affiliation></author><author><name sortKey="Warinschi, Bogdan" sort="Warinschi, Bogdan" uniqKey="Warinschi B" first="Bogdan" last="Warinschi">Bogdan Warinschi</name><affiliation wicri:level="1"><inist:fA14 i1="04"><s1>Loria, Univerité Henri Poincaré & INRIA project Cassis</s1><s3>FRA</s3><sZ>4 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>Univerité Henri Poincaré & INRIA project Cassis</wicri:noRegion><wicri:noRegion>Loria, Univerité Henri Poincaré & INRIA project Cassis</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno><imprint><date when="2006">2006</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer theory</term><term>Cryptography</term><term>Decidability</term><term>Decision making</term><term>Encryption</term><term>Hashing</term><term>Modeling</term><term>Oracle</term><term>Public key</term><term>Random function</term><term>Safety</term><term>Secrecy</term><term>Transmission protocol</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Informatique théorique</term><term>Hachage</term><term>Cryptographie</term><term>Protocole transmission</term><term>Sécurité</term><term>Décidabilité</term><term>Prise décision</term><term>Cryptage</term><term>Secret</term><term>Clé publique</term><term>Oracle</term><term>Fonction aléatoire</term><term>Modélisation</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Cryptographie</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper we devise and motivate a more appropriate secrecy criterion which exactly captures a standard cryptographic notion of secrecy for protocols involving public-key enryption and hash functions: protocols that satisfy it are computationally secure while any violation of our criterion directly leads to an attack. Furthermore, we prove that our criterion is decidable via an NP decision procedure. Our results hold for standard security notions for encryption and hash functions modeled as random oracles.</div></front></TEI><affiliations><list><country><li>France</li><li>Suisse</li></country><region><li>Canton de Zurich</li></region><settlement><li>Zurich</li></settlement><orgName><li>École polytechnique fédérale de Zurich</li></orgName></list><tree><country name="France"><noRegion><name sortKey="Cortier, Veronique" sort="Cortier, Veronique" uniqKey="Cortier V" first="Véronique" last="Cortier">Véronique Cortier</name></noRegion><name sortKey="Kremer, Steve" sort="Kremer, Steve" uniqKey="Kremer S" first="Steve" last="Kremer">Steve Kremer</name><name sortKey="Warinschi, Bogdan" sort="Warinschi, Bogdan" uniqKey="Warinschi B" first="Bogdan" last="Warinschi">Bogdan Warinschi</name></country><country name="Suisse"><region name="Canton de Zurich"><name sortKey="Kusters, Ralf" sort="Kusters, Ralf" uniqKey="Kusters R" first="Ralf" last="Kusters">Ralf Kusters</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 005616 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 005616 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= Pascal:07-0531787
|texte= Computationally sound symbolic secrecy in the presence of hash functions
}}
| This area was generated with Dilib version V0.6.33. |  |